Base | Representation |
---|---|
bin | 1010010101101101010… |
… | …11000010100010111111 |
3 | 1020221222010102012022011 |
4 | 11022312223002202333 |
5 | 21310024011213312 |
6 | 431111152232051 |
7 | 34444322431441 |
oct | 5126653024277 |
9 | 1227863365264 |
10 | 355252054207 |
11 | 127730583416 |
12 | 58a2523b627 |
13 | 27666a0b8cb |
14 | 132a11c6491 |
15 | 9393197da7 |
hex | 52b6ac28bf |
355252054207 has 4 divisors (see below), whose sum is σ = 355253346136. Its totient is φ = 355250762280.
The previous prime is 355252054181. The next prime is 355252054211. The reversal of 355252054207 is 702450252553.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 702450252553 = 7 ⋅100350036079.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-355252054207 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 355252054207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (355252054277) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 50568 + ... + 844429.
It is an arithmetic number, because the mean of its divisors is an integer number (88813336534).
Almost surely, 2355252054207 is an apocalyptic number.
355252054207 is a deficient number, since it is larger than the sum of its proper divisors (1291929).
355252054207 is an equidigital number, since it uses as much as digits as its factorization.
355252054207 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1291928.
The product of its (nonzero) digits is 420000, while the sum is 40.
The spelling of 355252054207 in words is "three hundred fifty-five billion, two hundred fifty-two million, fifty-four thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •