Base | Representation |
---|---|
bin | 1001001011111010010010… |
… | …1111100000110001010001 |
3 | 1022202120110112111000012102 |
4 | 2102332210233200301101 |
5 | 2310440233400000223 |
6 | 33251552121210145 |
7 | 2061501110506034 |
oct | 222764457406121 |
9 | 38676415430172 |
10 | 10100232031313 |
11 | 324453673a736 |
12 | 11715ab330955 |
13 | 5835a8a589a8 |
14 | 26cbd4d0d01b |
15 | 127ae4712928 |
hex | 92fa4be0c51 |
10100232031313 has 8 divisors (see below), whose sum is σ = 10106557462848. Its totient is φ = 10093907027664.
The previous prime is 10100232031297. The next prime is 10100232031327. The reversal of 10100232031313 is 31313023200101.
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 10100232031313 - 24 = 10100232031297 is a prime.
It is a super-2 number, since 2×101002320313132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10100232031333) 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, 56367020 + ... + 56545922.
It is an arithmetic number, because the mean of its divisors is an integer number (1263319682856).
Almost surely, 210100232031313 is an apocalyptic number.
It is an amenable number.
10100232031313 is a deficient number, since it is larger than the sum of its proper divisors (6325431535).
10100232031313 is a wasteful number, since it uses less digits than its factorization.
10100232031313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 213943.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 10100232031313 its reverse (31313023200101), we get a palindrome (41413255231414).
The spelling of 10100232031313 in words is "ten trillion, one hundred billion, two hundred thirty-two million, thirty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •