Base | Representation |
---|---|
bin | 1001001101101010000011… |
… | …1100111110001110001110 |
3 | 1022212102220101000101221011 |
4 | 2103122200330332032032 |
5 | 2311433204201101110 |
6 | 33313433114555434 |
7 | 2063612423434255 |
oct | 223324074761616 |
9 | 38772811011834 |
10 | 10130233222030 |
11 | 3256231617329 |
12 | 1177382738b7a |
13 | 58637a449a4c |
14 | 27043d58779c |
15 | 12879d4c448a |
hex | 936a0f3e38e |
10130233222030 has 128 divisors (see below), whose sum is σ = 18963855561600. Its totient is φ = 3894169042944.
The previous prime is 10130233222019. The next prime is 10130233222037. The reversal of 10130233222030 is 3022233203101.
It is a junction number, because it is equal to n+sod(n) for n = 10130233221992 and 10130233222010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10130233222037) 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 63 ways as a sum of consecutive naturals, for example, 6803379526 + ... + 6803381014.
It is an arithmetic number, because the mean of its divisors is an integer number (148155121575).
Almost surely, 210130233222030 is an apocalyptic number.
10130233222030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10130233222030 is a deficient number, since it is larger than the sum of its proper divisors (8833622339570).
10130233222030 is a wasteful number, since it uses less digits than its factorization.
10130233222030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2918.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 10130233222030 its reverse (3022233203101), we get a palindrome (13152466425131).
The spelling of 10130233222030 in words is "ten trillion, one hundred thirty billion, two hundred thirty-three million, two hundred twenty-two thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •