Base | Representation |
---|---|
bin | 11101111110101111111… |
… | …01001000111000000011 |
3 | 10122110220212002211100010 |
4 | 32333113331020320003 |
5 | 113334141244443243 |
6 | 2105121501200003 |
7 | 134265225116454 |
oct | 16772775107003 |
9 | 3573825084303 |
10 | 1030120312323 |
11 | 3679650743a3 |
12 | 147789260003 |
13 | 761a8566a5b |
14 | 37c0284d12b |
15 | 1bbe0c08433 |
hex | efd7f48e03 |
1030120312323 has 8 divisors (see below), whose sum is σ = 1373546674368. Its totient is φ = 686720412584.
The previous prime is 1030120312297. The next prime is 1030120312339. The reversal of 1030120312323 is 3232130210301.
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 1030120312323 - 210 = 1030120311299 is a prime.
It is a super-2 number, since 2×10301203123232 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1030120312323.
It is not an unprimeable number, because it can be changed into a prime (1030120314323) 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, 6524565 + ... + 6680582.
It is an arithmetic number, because the mean of its divisors is an integer number (171693334296).
Almost surely, 21030120312323 is an apocalyptic number.
1030120312323 is a deficient number, since it is larger than the sum of its proper divisors (343426362045).
1030120312323 is a wasteful number, since it uses less digits than its factorization.
1030120312323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13231153.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 1030120312323 its reverse (3232130210301), we get a palindrome (4262250522624).
The spelling of 1030120312323 in words is "one trillion, thirty billion, one hundred twenty million, three hundred twelve thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •