Base | Representation |
---|---|
bin | 1001001000100110111111… |
… | …1010110011001011110110 |
3 | 1022120011001120021101211021 |
4 | 2102021233322303023312 |
5 | 2304023102333114110 |
6 | 33205531513331354 |
7 | 2054422366550035 |
oct | 222115772631366 |
9 | 38504046241737 |
10 | 10043511223030 |
11 | 322247a28497a |
12 | 11625bb706b5a |
13 | 57b1397a683c |
14 | 26a173b7a71c |
15 | 1263c4d022da |
hex | 9226feb32f6 |
10043511223030 has 8 divisors (see below), whose sum is σ = 18078320201472. Its totient is φ = 4017404489208.
The previous prime is 10043511223021. The next prime is 10043511223037. The reversal of 10043511223030 is 3032211534001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 10043511222986 and 10043511223004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10043511223037) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 502175561142 + ... + 502175561161.
It is an arithmetic number, because the mean of its divisors is an integer number (2259790025184).
Almost surely, 210043511223030 is an apocalyptic number.
10043511223030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10043511223030 is a deficient number, since it is larger than the sum of its proper divisors (8034808978442).
10043511223030 is a wasteful number, since it uses less digits than its factorization.
10043511223030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1004351122310.
The product of its (nonzero) digits is 2160, while the sum is 25.
Adding to 10043511223030 its reverse (3032211534001), we get a palindrome (13075722757031).
The spelling of 10043511223030 in words is "ten trillion, forty-three billion, five hundred eleven million, two hundred twenty-three thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •