Base | Representation |
---|---|
bin | 101100000111000011011… |
… | …010011001101111110011 |
3 | 101201210010122211002111112 |
4 | 230013003122121233303 |
5 | 344130424442001003 |
6 | 10240310015503535 |
7 | 431666500315100 |
oct | 54070332315763 |
9 | 11653118732445 |
10 | 3031230422003 |
11 | a695a0604aa3 |
12 | 40b580b27bab |
13 | 18cac7aab554 |
14 | a69d890daa7 |
15 | 53cb13b73d8 |
hex | 2c1c3699bf3 |
3031230422003 has 24 divisors (see below), whose sum is σ = 3589385048640. Its totient is φ = 2551882838400.
The previous prime is 3031230421981. The next prime is 3031230422093. The reversal of 3031230422003 is 3002240321303.
It is not a de Polignac number, because 3031230422003 - 210 = 3031230420979 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3031230422003.
It is not an unprimeable number, because it can be changed into a prime (3031230422093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 917948 + ... + 2627753.
It is an arithmetic number, because the mean of its divisors is an integer number (149557710360).
Almost surely, 23031230422003 is an apocalyptic number.
3031230422003 is a deficient number, since it is larger than the sum of its proper divisors (558154626637).
3031230422003 is a wasteful number, since it uses less digits than its factorization.
3031230422003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3546027 (or 3546020 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 23.
Adding to 3031230422003 its reverse (3002240321303), we get a palindrome (6033470743306).
The spelling of 3031230422003 in words is "three trillion, thirty-one billion, two hundred thirty million, four hundred twenty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •