Base | Representation |
---|---|
bin | 100011101110110110110000… |
… | …0000010110011010011001010 |
3 | 1112012212002001002022000111021 |
4 | 1013131231200002303103022 |
5 | 312144020042403214010 |
6 | 3032244452052023054 |
7 | 123126433625042110 |
oct | 10735554002632312 |
9 | 1465762032260437 |
10 | 314303023101130 |
11 | 9116818874aa98 |
12 | 2b302046601a8a |
13 | 1064b8565999ab |
14 | 57884c1703ab0 |
15 | 2650b225248da |
hex | 11ddb600b34ca |
314303023101130 has 64 divisors (see below), whose sum is σ = 657741214690560. Its totient is φ = 105899738572800.
The previous prime is 314303023101097. The next prime is 314303023101139. The reversal of 314303023101130 is 31101320303413.
It is a junction number, because it is equal to n+sod(n) for n = 314303023101095 and 314303023101104.
It is not an unprimeable number, because it can be changed into a prime (314303023101139) 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, 46600 + ... + 25072060.
It is an arithmetic number, because the mean of its divisors is an integer number (10277206479540).
Almost surely, 2314303023101130 is an apocalyptic number.
314303023101130 is an abundant number, since it is smaller than the sum of its proper divisors (343438191589430).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
314303023101130 is a wasteful number, since it uses less digits than its factorization.
314303023101130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25028575.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 314303023101130 its reverse (31101320303413), we get a palindrome (345404343404543).
The spelling of 314303023101130 in words is "three hundred fourteen trillion, three hundred three billion, twenty-three million, one hundred one thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •