Base | Representation |
---|---|
bin | 11101001000110011110… |
… | …010001010111110011001 |
3 | 21002102100101000102111101 |
4 | 131020303302022332121 |
5 | 230301224312100410 |
6 | 4131504342431401 |
7 | 264443305232434 |
oct | 35106362127631 |
9 | 7072311012441 |
10 | 2002323550105 |
11 | 7021a949742a |
12 | 284092132561 |
13 | 116a83a637a8 |
14 | 6ccad2cc81b |
15 | 37141ea1d3a |
hex | 1d233c8af99 |
2002323550105 has 4 divisors (see below), whose sum is σ = 2402788260132. Its totient is φ = 1601858840080.
The previous prime is 2002323550099. The next prime is 2002323550147. The reversal of 2002323550105 is 5010553232002.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 456451574544 + 1545871975561 = 675612^2 + 1243331^2 .
It is not a de Polignac number, because 2002323550105 - 29 = 2002323549593 is a prime.
It is a super-2 number, since 2×20023235501052 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 200232355006 + ... + 200232355015.
It is an arithmetic number, because the mean of its divisors is an integer number (600697065033).
Almost surely, 22002323550105 is an apocalyptic number.
It is an amenable number.
2002323550105 is a deficient number, since it is larger than the sum of its proper divisors (400464710027).
2002323550105 is an equidigital number, since it uses as much as digits as its factorization.
2002323550105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 400464710026.
The product of its (nonzero) digits is 9000, while the sum is 28.
Adding to 2002323550105 its reverse (5010553232002), we get a palindrome (7012876782107).
The spelling of 2002323550105 in words is "two trillion, two billion, three hundred twenty-three million, five hundred fifty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •