Base | Representation |
---|---|
bin | 1011101101001111010… |
… | …10111100111000010101 |
3 | 1102110021010221211212221 |
4 | 11312213222330320111 |
5 | 23042244210404023 |
6 | 504442214342341 |
7 | 41030002124314 |
oct | 5664752747025 |
9 | 1373233854787 |
10 | 402245013013 |
11 | 145655906958 |
12 | 65b5b05a9b1 |
13 | 2bc157a01cc |
14 | 1567c3da27b |
15 | a6e3a5785d |
hex | 5da7abce15 |
402245013013 has 4 divisors (see below), whose sum is σ = 402443458560. Its totient is φ = 402046567468.
The previous prime is 402245012999. The next prime is 402245013017. The reversal of 402245013013 is 310310542204.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 402245013013 - 225 = 402211458581 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (402245013017) 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 3 ways as a sum of consecutive naturals, for example, 99219733 + ... + 99223786.
It is an arithmetic number, because the mean of its divisors is an integer number (100610864640).
Almost surely, 2402245013013 is an apocalyptic number.
It is an amenable number.
402245013013 is a deficient number, since it is larger than the sum of its proper divisors (198445547).
402245013013 is a wasteful number, since it uses less digits than its factorization.
402245013013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198445546.
The product of its (nonzero) digits is 2880, while the sum is 25.
Adding to 402245013013 its reverse (310310542204), we get a palindrome (712555555217).
The spelling of 402245013013 in words is "four hundred two billion, two hundred forty-five million, thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •