Base | Representation |
---|---|
bin | 10000000001110001110… |
… | …100100100001101101011 |
3 | 10220021221221100212220010 |
4 | 100001301310210031223 |
5 | 121021202313424003 |
6 | 2201552543303003 |
7 | 142401150003000 |
oct | 20016164441553 |
9 | 3807857325803 |
10 | 1101421233003 |
11 | 395123632423 |
12 | 1595678aaa63 |
13 | 7cb2c37c450 |
14 | 3b4481458a7 |
15 | 1d9b563c003 |
hex | 10071d2436b |
1101421233003 has 64 divisors (see below), whose sum is σ = 1850284800000. Its totient is φ = 579099185280.
The previous prime is 1101421232959. The next prime is 1101421233013. The reversal of 1101421233003 is 3003321241011.
It is not a de Polignac number, because 1101421233003 - 214 = 1101421216619 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (1101421233013) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 4027873 + ... + 4292621.
It is an arithmetic number, because the mean of its divisors is an integer number (28910700000).
Almost surely, 21101421233003 is an apocalyptic number.
1101421233003 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1101421233003 is a deficient number, since it is larger than the sum of its proper divisors (748863566997).
1101421233003 is a wasteful number, since it uses less digits than its factorization.
1101421233003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 265097 (or 265083 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1101421233003 its reverse (3003321241011), we get a palindrome (4104742474014).
The spelling of 1101421233003 in words is "one trillion, one hundred one billion, four hundred twenty-one million, two hundred thirty-three thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •