Base | Representation |
---|---|
bin | 10111010000101011001111… |
… | …100011000010000011111001 |
3 | 111102012212210111110101220212 |
4 | 113100223033203002003321 |
5 | 101402044433324421241 |
6 | 1001324234151400505 |
7 | 30356001321032165 |
oct | 2720531743020371 |
9 | 442185714411825 |
10 | 102301013123321 |
11 | 2a661685a20861 |
12 | b582756383135 |
13 | 4510c3738c46c |
14 | 1b395771a9ca5 |
15 | bc613dd80beb |
hex | 5d0acf8c20f9 |
102301013123321 has 32 divisors (see below), whose sum is σ = 110145579667200. Its totient is φ = 94670800588800.
The previous prime is 102301013123297. The next prime is 102301013123333. The reversal of 102301013123321 is 123321310103201.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102301013123321 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102301013123021) 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 31 ways as a sum of consecutive naturals, for example, 842956796 + ... + 843078146.
It is an arithmetic number, because the mean of its divisors is an integer number (3442049364600).
Almost surely, 2102301013123321 is an apocalyptic number.
It is an amenable number.
102301013123321 is a deficient number, since it is larger than the sum of its proper divisors (7844566543879).
102301013123321 is a wasteful number, since it uses less digits than its factorization.
102301013123321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124289.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 102301013123321 its reverse (123321310103201), we get a palindrome (225622323226522).
The spelling of 102301013123321 in words is "one hundred two trillion, three hundred one billion, thirteen million, one hundred twenty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •