Base | Representation |
---|---|
bin | 111010010010010000111… |
… | …011011010100011011001 |
3 | 112011220111002202100002010 |
4 | 322102100323122203121 |
5 | 1011110414244423413 |
6 | 12304010034300133 |
7 | 562243040611146 |
oct | 72222073324331 |
9 | 15156432670063 |
10 | 4005341014233 |
11 | 1304723646719 |
12 | 548318727649 |
13 | 2309184b54a0 |
14 | dbc0680d3cd |
15 | 6e2c4d22dc3 |
hex | 3a490eda8d9 |
4005341014233 has 32 divisors (see below), whose sum is σ = 5842976832000. Its totient is φ = 2425821094656.
The previous prime is 4005341014231. The next prime is 4005341014243. The reversal of 4005341014233 is 3324101435004.
4005341014233 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 4005341014233 - 21 = 4005341014231 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 4005341014233.
It is not an unprimeable number, because it can be changed into a prime (4005341014231) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2528385 + ... + 3795182.
It is an arithmetic number, because the mean of its divisors is an integer number (182593026000).
Almost surely, 24005341014233 is an apocalyptic number.
It is an amenable number.
4005341014233 is a deficient number, since it is larger than the sum of its proper divisors (1837635817767).
4005341014233 is a wasteful number, since it uses less digits than its factorization.
4005341014233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6323841.
The product of its (nonzero) digits is 17280, while the sum is 30.
Adding to 4005341014233 its reverse (3324101435004), we get a palindrome (7329442449237).
The spelling of 4005341014233 in words is "four trillion, five billion, three hundred forty-one million, fourteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •