Base | Representation |
---|---|
bin | 110001111011011111010… |
… | …010101100001100111111 |
3 | 110011000100100122122102020 |
4 | 301323133102230030333 |
5 | 422203423302333043 |
6 | 11144123414131223 |
7 | 502614413551323 |
oct | 61733722541477 |
9 | 13130310578366 |
10 | 3431130121023 |
11 | 110315255a820 |
12 | 474b86650b13 |
13 | 1bb7286cc0a7 |
14 | bc0d3643983 |
15 | 5e3b909be83 |
hex | 31edf4ac33f |
3431130121023 has 16 divisors (see below), whose sum is σ = 5000899174272. Its totient is φ = 2075237612000.
The previous prime is 3431130120991. The next prime is 3431130121039. The reversal of 3431130121023 is 3201210311343.
It is a cyclic number.
It is not a de Polignac number, because 3431130121023 - 25 = 3431130120991 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3431130120984 and 3431130121002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3431130121073) 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, 105863268 + ... + 105895673.
It is an arithmetic number, because the mean of its divisors is an integer number (312556198392).
Almost surely, 23431130121023 is an apocalyptic number.
3431130121023 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
3431130121023 is a deficient number, since it is larger than the sum of its proper divisors (1569769053249).
3431130121023 is a wasteful number, since it uses less digits than its factorization.
3431130121023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 211759446.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 3431130121023 its reverse (3201210311343), we get a palindrome (6632340432366).
The spelling of 3431130121023 in words is "three trillion, four hundred thirty-one billion, one hundred thirty million, one hundred twenty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •