Base | Representation |
---|---|
bin | 11101001000110010011… |
… | …001001101110111010011 |
3 | 21002102021202010200212101 |
4 | 131020302121031313103 |
5 | 230301202324343443 |
6 | 4131502150541231 |
7 | 264442603101163 |
oct | 35106231156723 |
9 | 7072252120771 |
10 | 2002300231123 |
11 | 70219730a545 |
12 | 284086367817 |
13 | 116a7bc8a78a |
14 | 6ccaa17c5a3 |
15 | 3713ede784d |
hex | 1d23264ddd3 |
2002300231123 has 8 divisors (see below), whose sum is σ = 2051944781040. Its totient is φ = 1952694155520.
The previous prime is 2002300231117. The next prime is 2002300231157. The reversal of 2002300231123 is 3211320032002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2002300231123 - 229 = 2001763360211 is a prime.
It is a super-2 number, since 2×20023002311232 (a number of 25 digits) contains 22 as substring.
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 2002300231123.
It is not an unprimeable number, because it can be changed into a prime (2002300231103) 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, 9513190 + ... + 9721387.
It is an arithmetic number, because the mean of its divisors is an integer number (256493097630).
Almost surely, 22002300231123 is an apocalyptic number.
2002300231123 is a deficient number, since it is larger than the sum of its proper divisors (49644549917).
2002300231123 is a wasteful number, since it uses less digits than its factorization.
2002300231123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19237157.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 2002300231123 its reverse (3211320032002), we get a palindrome (5213620263125).
The spelling of 2002300231123 in words is "two trillion, two billion, three hundred million, two hundred thirty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •