Base | Representation |
---|---|
bin | 10111011010111111110000… |
… | …010111011010110101000010 |
3 | 111111201200102021101212211110 |
4 | 113122333300113122311002 |
5 | 102000204424213043020 |
6 | 1003030125314024150 |
7 | 30461146416236535 |
oct | 2732776027326502 |
9 | 444650367355743 |
10 | 103010233331010 |
11 | 2a905438275a05 |
12 | b6780a6878056 |
13 | 4562a91aba7a5 |
14 | 1b61a16c48a1c |
15 | bd97ec6118e0 |
hex | 5daff05dad42 |
103010233331010 has 32 divisors (see below), whose sum is σ = 250353984810240. Its totient is φ = 27121681686528.
The previous prime is 103010233330903. The next prime is 103010233331011. The reversal of 103010233331010 is 10133332010301.
It is a super-2 number, since 2×1030102333310102 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (103010233331011) 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, 21732114367 + ... + 21732119106.
It is an arithmetic number, because the mean of its divisors is an integer number (7823562025320).
Almost surely, 2103010233331010 is an apocalyptic number.
103010233331010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103010233331010 is an abundant number, since it is smaller than the sum of its proper divisors (147343751479230).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103010233331010 is a wasteful number, since it uses less digits than its factorization.
103010233331010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43464233562.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 103010233331010 its reverse (10133332010301), we get a palindrome (113143565341311).
The spelling of 103010233331010 in words is "one hundred three trillion, ten billion, two hundred thirty-three million, three hundred thirty-one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •