Base | Representation |
---|---|
bin | 1001000111010000010001… |
… | …0100100100010011011010 |
3 | 1022110220222010210210121112 |
4 | 2101310010110210103122 |
5 | 2303132413141431020 |
6 | 33151121453540322 |
7 | 2052636445621451 |
oct | 221640424442332 |
9 | 38426863723545 |
10 | 10020231202010 |
11 | 3213613317587 |
12 | 1159ba31a46a2 |
13 | 578b996c3583 |
14 | 268da5dd9b98 |
15 | 1259b112d2c5 |
hex | 91d045244da |
10020231202010 has 8 divisors (see below), whose sum is σ = 18036416163636. Its totient is φ = 4008092480800.
The previous prime is 10020231201973. The next prime is 10020231202031. The reversal of 10020231202010 is 1020213202001.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 9002838223729 + 1017392978281 = 3000473^2 + 1008659^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
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 3 ways as a sum of consecutive naturals, for example, 501011560091 + ... + 501011560110.
Almost surely, 210020231202010 is an apocalyptic number.
10020231202010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10020231202010 is a deficient number, since it is larger than the sum of its proper divisors (8016184961626).
10020231202010 is a wasteful number, since it uses less digits than its factorization.
10020231202010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1002023120208.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 10020231202010 its reverse (1020213202001), we get a palindrome (11040444404011).
Subtracting from 10020231202010 its reverse (1020213202001), we obtain a square (9000018000009 = 30000032).
The spelling of 10020231202010 in words is "ten trillion, twenty billion, two hundred thirty-one million, two hundred two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •