Base | Representation |
---|---|
bin | 100001011101011010100… |
… | …011011001001100101110 |
3 | 22010210222000220021100022 |
4 | 201131122203121030232 |
5 | 300133010120343204 |
6 | 4520143543402142 |
7 | 325056313511243 |
oct | 41353243311456 |
9 | 8123860807308 |
10 | 2299326731054 |
11 | 807158aa6171 |
12 | 31175ba53352 |
13 | 138a96a52992 |
14 | 7d4064155ca |
15 | 3ec264e95be |
hex | 2175a8d932e |
2299326731054 has 16 divisors (see below), whose sum is σ = 3560284962816. Its totient is φ = 1112565850200.
The previous prime is 2299326731041. The next prime is 2299326731089. The reversal of 2299326731054 is 4501376239922.
It is a happy number.
2299326731054 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×22993267310542 (a number of 26 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (53) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 2299326730987 and 2299326731005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10818599 + ... + 11029085.
It is an arithmetic number, because the mean of its divisors is an integer number (222517810176).
Almost surely, 22299326731054 is an apocalyptic number.
2299326731054 is a deficient number, since it is larger than the sum of its proper divisors (1260958231762).
2299326731054 is a wasteful number, since it uses less digits than its factorization.
2299326731054 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 386711.
The product of its (nonzero) digits is 4898880, while the sum is 53.
The spelling of 2299326731054 in words is "two trillion, two hundred ninety-nine billion, three hundred twenty-six million, seven hundred thirty-one thousand, fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •