Base | Representation |
---|---|
bin | 1001010011001110110110… |
… | …0001000011101110001011 |
3 | 1100012121010000022222111211 |
4 | 2110303231201003232023 |
5 | 2320020330244440132 |
6 | 33425432432033551 |
7 | 2103542662405201 |
oct | 224635541035613 |
9 | 40177100288454 |
10 | 10226007030667 |
11 | 329290941729a |
12 | 1191a510928b7 |
13 | 59240151022c |
14 | 274d27215071 |
15 | 12b0066a9147 |
hex | 94ced843b8b |
10226007030667 has 8 divisors (see below), whose sum is σ = 10368732748880. Its totient is φ = 10084170569760.
The previous prime is 10226007030653. The next prime is 10226007030703. The reversal of 10226007030667 is 76603070062201.
10226007030667 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10226007030667 - 27 = 10226007030539 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10226007030637) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 222291168 + ... + 222337165.
It is an arithmetic number, because the mean of its divisors is an integer number (1296091593610).
Almost surely, 210226007030667 is an apocalyptic number.
10226007030667 is a deficient number, since it is larger than the sum of its proper divisors (142725718213).
10226007030667 is a wasteful number, since it uses less digits than its factorization.
10226007030667 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 444628653.
The product of its (nonzero) digits is 127008, while the sum is 40.
Adding to 10226007030667 its reverse (76603070062201), we get a palindrome (86829077092868).
The spelling of 10226007030667 in words is "ten trillion, two hundred twenty-six billion, seven million, thirty thousand, six hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •