Base | Representation |
---|---|
bin | 110100010111010101110100… |
… | …110011100001010000011010 |
3 | 1010012102200202022020101110011 |
4 | 310113111310303201100122 |
5 | 220141233304131311214 |
6 | 2133451243520312134 |
7 | 66336541122321241 |
oct | 6427256463412032 |
9 | 1105380668211404 |
10 | 230302401041434 |
11 | 67421777464667 |
12 | 219b619417264a |
13 | 9b67566abb6b7 |
14 | 40c29a4d63958 |
15 | 1b95a62206ac4 |
hex | d17574ce141a |
230302401041434 has 16 divisors (see below), whose sum is σ = 362641287594240. Its totient is φ = 109547888957280.
The previous prime is 230302401041431. The next prime is 230302401041521. The reversal of 230302401041434 is 434140104203032.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a junction number, because it is equal to n+sod(n) for n = 230302401041396 and 230302401041405.
It is not an unprimeable number, because it can be changed into a prime (230302401041431) 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 7 ways as a sum of consecutive naturals, for example, 31479274779 + ... + 31479282094.
It is an arithmetic number, because the mean of its divisors is an integer number (22665080474640).
Almost surely, 2230302401041434 is an apocalyptic number.
230302401041434 is a deficient number, since it is larger than the sum of its proper divisors (132338886552806).
230302401041434 is a wasteful number, since it uses less digits than its factorization.
230302401041434 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62958556965.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 230302401041434 its reverse (434140104203032), we get a palindrome (664442505244466).
The spelling of 230302401041434 in words is "two hundred thirty trillion, three hundred two billion, four hundred one million, forty-one thousand, four hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •