Base | Representation |
---|---|
bin | 11110110100001110001… |
… | …01100110110000000111 |
3 | 10202020000120100011102102 |
4 | 33122013011212300013 |
5 | 114321440024122143 |
6 | 2130230302102315 |
7 | 136332516314636 |
oct | 17320705466007 |
9 | 3666016304372 |
10 | 1058828348423 |
11 | 379056aa986a |
12 | 15125b57a99b |
13 | 78b02078871 |
14 | 3936746951d |
15 | 1c8211cd0b8 |
hex | f687166c07 |
1058828348423 has 4 divisors (see below), whose sum is σ = 1058832405720. Its totient is φ = 1058824291128.
The previous prime is 1058828348407. The next prime is 1058828348441. The reversal of 1058828348423 is 3248438288501.
1058828348423 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1058828348423 - 24 = 1058828348407 is a prime.
It is a super-2 number, since 2×10588283484232 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1058828348443) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1608140 + ... + 2168817.
It is an arithmetic number, because the mean of its divisors is an integer number (264708101430).
Almost surely, 21058828348423 is an apocalyptic number.
1058828348423 is a deficient number, since it is larger than the sum of its proper divisors (4057297).
1058828348423 is an equidigital number, since it uses as much as digits as its factorization.
1058828348423 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4057296.
The product of its (nonzero) digits is 11796480, while the sum is 56.
The spelling of 1058828348423 in words is "one trillion, fifty-eight billion, eight hundred twenty-eight million, three hundred forty-eight thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •