Base | Representation |
---|---|
bin | 1001010011011110001101… |
… | …1001011100101101011001 |
3 | 1100012222202111121212112101 |
4 | 2110313203121130231121 |
5 | 2320102302322343001 |
6 | 33431354033243401 |
7 | 2104050133132264 |
oct | 224674331345531 |
9 | 40188674555471 |
10 | 10230132231001 |
11 | 3294635a44371 |
12 | 1192802703561 |
13 | 59290b059887 |
14 | 2751d9039cdb |
15 | 12b198910a01 |
hex | 94de365cb59 |
10230132231001 has 8 divisors (see below), whose sum is σ = 10258184150144. Its totient is φ = 10202081274000.
The previous prime is 10230132230999. The next prime is 10230132231061. The reversal of 10230132231001 is 10013223103201.
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 10230132231001 - 21 = 10230132230999 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 10230132231001.
It is not an unprimeable number, because it can be changed into a prime (10230132231061) 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, 24548626 + ... + 24961876.
It is an arithmetic number, because the mean of its divisors is an integer number (1282273018768).
Almost surely, 210230132231001 is an apocalyptic number.
It is an amenable number.
10230132231001 is a deficient number, since it is larger than the sum of its proper divisors (28051919143).
10230132231001 is an equidigital number, since it uses as much as digits as its factorization.
10230132231001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 481071.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 10230132231001 its reverse (10013223103201), we get a palindrome (20243355334202).
The spelling of 10230132231001 in words is "ten trillion, two hundred thirty billion, one hundred thirty-two million, two hundred thirty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •