Base | Representation |
---|---|
bin | 1001001000011011100010… |
… | …0000111100000010100110 |
3 | 1022112212010010100002121221 |
4 | 2102012320200330002212 |
5 | 2304000302124304110 |
6 | 33204302314330554 |
7 | 2054253214443304 |
oct | 222067040740246 |
9 | 38485103302557 |
10 | 10040434213030 |
11 | 32211403a5801 |
12 | 1161aa1129a5a |
13 | 57aa6916ab70 |
14 | 269d61249274 |
15 | 126294aea7da |
hex | 921b883c0a6 |
10040434213030 has 16 divisors (see below), whose sum is σ = 19462995551664. Its totient is φ = 3707237247840.
The previous prime is 10040434212989. The next prime is 10040434213049. The reversal of 10040434213030 is 3031243404001.
It is a super-3 number, since 3×100404342130303 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10040434212986 and 10040434213004.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38617054536 + ... + 38617054795.
It is an arithmetic number, because the mean of its divisors is an integer number (1216437221979).
Almost surely, 210040434213030 is an apocalyptic number.
10040434213030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10040434213030 is a deficient number, since it is larger than the sum of its proper divisors (9422561338634).
10040434213030 is a wasteful number, since it uses less digits than its factorization.
10040434213030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77234109351.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 10040434213030 its reverse (3031243404001), we get a palindrome (13071677617031).
The spelling of 10040434213030 in words is "ten trillion, forty billion, four hundred thirty-four million, two hundred thirteen thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •