Base | Representation |
---|---|
bin | 10110111110000101000001… |
… | …110100010110000010011101 |
3 | 111020200201002122202200100120 |
4 | 112332011001310112002131 |
5 | 101220130131140310023 |
6 | 554505201142145153 |
7 | 30164446600560516 |
oct | 2676050164260235 |
9 | 436621078680316 |
10 | 101023030010013 |
11 | 2a2096988594a1 |
12 | b3b6b344221b9 |
13 | 444a57a77a337 |
14 | 1ad377db19a0d |
15 | ba2c92cc28e3 |
hex | 5be141d1609d |
101023030010013 has 8 divisors (see below), whose sum is σ = 134697419824800. Its totient is φ = 67348663434288.
The previous prime is 101023030010009. The next prime is 101023030010041. The reversal of 101023030010013 is 310010030320101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101023030010013 - 22 = 101023030010009 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 101023030009974 and 101023030010001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101023030010083) 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, 13540578 + ... + 19631436.
It is an arithmetic number, because the mean of its divisors is an integer number (16837177478100).
Almost surely, 2101023030010013 is an apocalyptic number.
It is an amenable number.
101023030010013 is a deficient number, since it is larger than the sum of its proper divisors (33674389814787).
101023030010013 is an equidigital number, since it uses as much as digits as its factorization.
101023030010013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11619531.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 101023030010013 its reverse (310010030320101), we get a palindrome (411033060330114).
The spelling of 101023030010013 in words is "one hundred one trillion, twenty-three billion, thirty million, ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •