Base | Representation |
---|---|
bin | 11101110001111010110… |
… | …00010111000000100011 |
3 | 10121211010210112221010220 |
4 | 32320331120113000203 |
5 | 113231034343343243 |
6 | 2102022153054123 |
7 | 133632433412253 |
oct | 16707530270043 |
9 | 3554123487126 |
10 | 1023232012323 |
11 | 364a4a882684 |
12 | 1463863b7343 |
13 | 7564b43cbb1 |
14 | 3774ba8b963 |
15 | 1b93b105783 |
hex | ee3d617023 |
1023232012323 has 8 divisors (see below), whose sum is σ = 1377817363536. Its totient is φ = 675400668000.
The previous prime is 1023232012247. The next prime is 1023232012381. The reversal of 1023232012323 is 3232102323201.
1023232012323 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1023232012323 - 229 = 1022695141411 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1023232012293 and 1023232012302.
It is not an unprimeable number, because it can be changed into a prime (1023232012823) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1688501368 + ... + 1688501973.
It is an arithmetic number, because the mean of its divisors is an integer number (172227170442).
Almost surely, 21023232012323 is an apocalyptic number.
1023232012323 is a deficient number, since it is larger than the sum of its proper divisors (354585351213).
1023232012323 is a wasteful number, since it uses less digits than its factorization.
1023232012323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3377003445.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 1023232012323 its reverse (3232102323201), we get a palindrome (4255334335524).
The spelling of 1023232012323 in words is "one trillion, twenty-three billion, two hundred thirty-two million, twelve thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •