Base | Representation |
---|---|
bin | 11110000010100111111… |
… | …10011010101010101011 |
3 | 10122200021212022211121001 |
4 | 33001103332122222223 |
5 | 113402421430201443 |
6 | 2110104150055431 |
7 | 134400621632005 |
oct | 17012376325253 |
9 | 3580255284531 |
10 | 1032201022123 |
11 | 368832627477 |
12 | 14806a04a577 |
13 | 7644a65c59b |
14 | 37d5cd17375 |
15 | 1bcb370ed4d |
hex | f053f9aaab |
1032201022123 has 8 divisors (see below), whose sum is σ = 1034337711600. Its totient is φ = 1030064760288.
The previous prime is 1032201022093. The next prime is 1032201022129. The reversal of 1032201022123 is 3212201022301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1032201022123 - 229 = 1031664151211 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1032201022123.
It is not an unprimeable number, because it can be changed into a prime (1032201022129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4974588 + ... + 5177926.
It is an arithmetic number, because the mean of its divisors is an integer number (129292213950).
Almost surely, 21032201022123 is an apocalyptic number.
1032201022123 is a deficient number, since it is larger than the sum of its proper divisors (2136689477).
1032201022123 is an equidigital number, since it uses as much as digits as its factorization.
1032201022123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 213821.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 1032201022123 its reverse (3212201022301), we get a palindrome (4244402044424).
The spelling of 1032201022123 in words is "one trillion, thirty-two billion, two hundred one million, twenty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •