Base | Representation |
---|---|
bin | 100101101000010110111110… |
… | …0010111011110100010100111 |
3 | 1121101222111212120111110001021 |
4 | 1023100231330113132202213 |
5 | 321341120233232130043 |
6 | 3131552212142112011 |
7 | 126502062222202630 |
oct | 11320557427364247 |
9 | 1541874776443037 |
10 | 331002331130023 |
11 | 96516333789a03 |
12 | 3115a576b7b607 |
13 | 11290502a64177 |
14 | 5ba4853a7c887 |
15 | 28401e486e3ed |
hex | 12d0b7c5de8a7 |
331002331130023 has 16 divisors (see below), whose sum is σ = 386938807130944. Its totient is φ = 277287711816960.
The previous prime is 331002331129997. The next prime is 331002331130137. The reversal of 331002331130023 is 320031133200133.
It is a cyclic number.
It is not a de Polignac number, because 331002331130023 - 241 = 328803307874471 is a prime.
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 331002331130023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (331002331136023) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2468662590 + ... + 2468796667.
It is an arithmetic number, because the mean of its divisors is an integer number (24183675445684).
Almost surely, 2331002331130023 is an apocalyptic number.
331002331130023 is a deficient number, since it is larger than the sum of its proper divisors (55936476000921).
331002331130023 is a wasteful number, since it uses less digits than its factorization.
331002331130023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4937459482.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 331002331130023 its reverse (320031133200133), we get a palindrome (651033464330156).
The spelling of 331002331130023 in words is "three hundred thirty-one trillion, two billion, three hundred thirty-one million, one hundred thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •